Full-rank representations of {2, 4}, {2, 3}-inverses and successive matrix squaring algorithm

نویسندگان

  • Predrag S. Stanimirovic
  • Dragana S. Cvetkovic-Ilic
  • Sladjana Miljkovic
  • Marko Miladinovic
چکیده

We present the full-rank representations of {2, 4} and {2, 3}-inverses (with given rank as well as with prescribed range and null space) as particular cases of the full-rank representation of outer inverses. As a consequence, two applications of the successive matrix squaring (SMS) algorithm from [P.S. Stanimirović, D.S. Cvetković-Ilić, Successive matrix squaring algorithm for computing outer inverses, Appl. Math. Comput. 203 (2008), 19–29] are defined using the full-rank representations of {2, 4} and {2, 3}-inverses. The first application is used to approximate {2, 4}-inverses. The second application, after appropriate modifications of the SMS iterative procedure, computes {2, 3}-inverses of a given matrix. Presented numerical examples clarify the purpose of the introduced methods. AMS Subj. Class.: 15A09.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Successive matrix squaring algorithm for computing outer inverses

In this paper we derive a successive matrix squaring (SMS) algorithm to approximate an outer generalized inverse with prescribed range and null space of a given matrix A ∈ Cm×n r . We generalize the results from the papers [3], [16], [18], and obtain an algorithm for computing various classes of outer generalized inverses of A. Instead of particular matrices used in these articles, we use an ap...

متن کامل

Representations of generalized inverses of partitioned matrix involving Schur complement

In this article, we consider some representations of {1, 3}, {1, 4}, {1, 2, 3} and {1, 2, 4}-inverses of a partitioned matrix M which are equivalent to some rank additivity conditions. We present some applications of these results to generalizations of the Sherman-Morrison-Woodbury-type formulae.

متن کامل

Computing generalized inverses using LU factorization of matrix product

An algorithm for computing {2, 3}, {2, 4}, {1, 2, 3}, {1, 2, 4}-inverses and the Moore-Penrose inverse of a given rational matrix A is established. Classes A{2, 3}s and A{2, 4}s are characterized in terms of matrix products (R∗A)†R∗ and T ∗(AT ∗)†, where R and T are rational matrices with appropriate dimensions and corresponding rank. The proposed algorithm is based on these general representat...

متن کامل

Successive Matrix Squaring Algorithm for Computing the Generalized Inverse AT,S(2)

We investigate successive matrix squaring SMS algorithms for computing the generalized inverse A 2 T,S of a given matrix A ∈ C m×n .

متن کامل

Gauss-Jordan elimination method for computing outer inverses

This paper deals with the algorithm for computing outer inverse with prescribed range and null space, based on the choice of an appropriate matrix G and Gauss–Jordan elimination of the augmented matrix [G | I]. The advantage of such algorithms is the fact that one can compute various generalized inverses using the same procedure, for different input matrices. In particular, we derive representa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 217  شماره 

صفحات  -

تاریخ انتشار 2011